Interpolation and extrapolation using a high-resolution discrete Fourier transform
نویسندگان
چکیده
We present an iterative nonparametric approach to spectral estimation that is particularly suitable for estimation of line spectra. This approach minimizes a cost function derived from Bayes’ theorem. The method is suitable for line spectra since a “long tailed” distribution is used to model the prior distribution of spectral amplitudes. An important aspect of this method is that since the data themselves are used as constraints, phase information can also be recovered and used to extend the data outside the original window. The objective function is formulated in terms of hyperparameters that control the degree of fit and spectral resolution. Noise rejection can also be achieved by truncating the number of iterations. Spectral resolution and extrapolation length are controlled by a single parameter. When this parameter is large compared with the spectral powers, the algorithm leads to zero extrapolation of the data, and the estimated Fourier transform yields the periodogram. When the data are sampled at a constant rate, the algorithm uses one Levinson recursion per iteration. For irregular sampling (unevenly sampled and/or gapped data), the algorithm uses one Cholesky decomposition per iteration. The performance of the algorithm is illustrated with three different problems that frequently arise in geophysical data processing: 1) harmonic retrieval from a time series contaminated with noise; 2) linear event detection from a finite aperture array of receivers [which, in fact, is an extension of 1)], 3) interpolation/extrapolation of gapped data. The performance of the algorithm as a spectral estimator is tested with the Kay and Marple data set. It is shown that the achieved resolution is comparable with parametric methods but with more accurate representation of the relative power in the spectral lines.
منابع مشابه
Interpolation and extrapolation of image partitions using Fourier descriptors: application to segmentation-based coding schemes
This paper presents an interpolation/extrapolation technique for sequence partitions. It consists of four steps: region parametrization, region interpolation, region ordering and partition creation. The evolution of each region is divided into two types: regular motion and random deformations. Both types of evolution are parametrized by means of the Fourier descriptors of the regions and they a...
متن کاملA Novel Method for Impedance Calculation of Distance Relays Using Third Order Interpolation
All algorithms for impedance calculation use an analog-to-digital converter. The high accuracy of the impedance seen by a distance relay is an important factor in the correct isolation of the faulty part of power systems. To achieve this, a novel technique based on third order interpolation is used in this paper. According to this technique, the times and the values of the obtained samples are...
متن کاملDetection of high impedance faults in distribution networks using Discrete Fourier Transform
In this paper, a new method for extracting dynamic properties for High Impedance Fault (HIF) detection using discrete Fourier transform (DFT) is proposed. Unlike conventional methods that use features extracted from data windows after fault to detect high impedance fault, in the proposed method, using the disturbance detection algorithm in the network, the normalized changes of the selected fea...
متن کاملA Novel Method for Impedance Calculation of Distance Relays Using Third Order Interpolation
All algorithms for impedance calculation use an analog-to-digital converter. The high accuracy of the impedance seen by a distance relay is an important factor in the correct isolation of the faulty part of power systems. To achieve this, a novel
technique based on third order interpolation is used in this paper. According to this technique, the times and the values of the obtained samples a...
متن کاملResolution enhancement of low resolution wavefields with POCS algorithm - Electronics Letters
Introduction: The fractional Fourier transform (FRT) has received significant interest since the early 1990s [1, 2]. The ath order FRT operation corresponds to the ath power of the ordinary Fourier transform operation. The zeroth-order FRT of a function is the function itself and the first-order FRT is equal to the ordinary Fourier transform. For additional properties and references, see [3]. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Signal Processing
دوره 46 شماره
صفحات -
تاریخ انتشار 1998